A non-dense subspace inMqpwith1<q<p<∞

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subspace Clustering Reloaded: Sparse vs. Dense Representations

State-of-the-art methods for learning unions of subspaces from a collection of data leverage sparsity to form representations of each vector in the dataset with respect to the remaining vectors in the dataset. The resulting sparse representations can be used to form a subspace affinity matrix to cluster the data into their respective subspaces. While sparsity-driven methods for subspace cluster...

متن کامل

Dense Multi-frame Optic Flow for Non-rigid Objects Using Subspace Constraints

In this paper we describe a variational approach to computing dense optic flow in the case of non-rigid motion. We optimise a global energy to compute the optic flow between each image in a sequence and a reference frame simultaneously. Our approach is based on subspace constraints which allow to express the optic flow at each pixel in a compact way as a linear combination of a 2D motion basis ...

متن کامل

Has a Non - Trivial Invariant Subspace

In this paper, to solve the invariant subspace problem, contraction operators are classified into three classes ; (Case 1) completely nonunitary contractions with a non-trivial algebraic element, (Case 2) completely non-unitary contractions without a non-trivial algebraic element, or (Case 3) contractions which are not completely non-unitary. We know that every operator of (Case 3) has a non-tr...

متن کامل

A non - Tychonoff relatively normal subspace

This paper presents a new consistent example of a relatively normal subspace which is not Tychonoff.

متن کامل

Dense and Non-Dense Families of Complexity Classes

Let t be any abstract measure of computational complexity, and let L denote the specific measure of memory resource (tape) on one tape Turing machines. De~ote by R:() the class of all total functions whose t-complexity is bounded by the function t() almost everywhere. Call such classes t-complexity classes. We are interested in relationships among these classes, under proper set inclusion (C). ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of A. Razmadze Mathematical Institute

سال: 2017

ISSN: 2346-8092

DOI: 10.1016/j.trmi.2017.05.001